Reductions towards a characteristic free proof of the Canonical Element Theorem

نویسندگان

چکیده

We reduce Hochster's Canonical Element Conjecture (theorem since 2016) to a localization problem in characteristic free way. prove the validity of new variant Theorem (CET) and explain how deduction from original CET would provide us with proof CET. also show that Balanced Big Cohen-Macaulay Module can be settled by if big Cohen-Macaulayness modification module deduced existence maximal complex

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple Characteristic-free Proof of the Brill-noether Theorem

We describe how the use of a different degeneration from that considered by Eisenbud and Harris leads to a simple and characteristic-independent proof of the Brill-Noether theorem using limit linear series. As suggested by the degeneration, we prove an extended version of the theorem allowing for imposed ramification at up to two points. Although experts in the field have long been aware of the...

متن کامل

POSITIVE CHARACTERISTIC MANIN - MUMFORD THEOREM 3 Proof

We present the details of a model theoretic proof of an analogue of the Manin-Mumford conjecture for semiabelian varieties in positive characteristic.

متن کامل

A direct proof of the five element basis theorem

We present a direct proof of the consistency of the existence of a five element basis for the uncountable linear orders. Our argument is based on the approach of Larson, Koenig, Moore and Velickovic and simplifies the original proof of Moore.

متن کامل

Another proof of Banaschewski's surjection theorem

We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...

متن کامل

MultiAgent Theorem Proving: Towards automating the dynamics of a proof

The proof planning systems available today are sequential systems. The hypothesis of this project is that the engineering of a proof planning system that is capable of dynamic, distributed, parallel proof planning will empower the paradigm of proof planning by unlocking its latent potential for these features. The system will be built on IsaPlanner, which is a proof planning system developed by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2023

ISSN: ['1090-266X', '0021-8693']

DOI: https://doi.org/10.1016/j.jalgebra.2023.05.007